package tree;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

/**
 * Created with IntelliJ IDEA.
 * Description:
 */
public class Text {
    public List<Integer> list =new ArrayList<>();
    public static void main(String[] args) {
        Stack<String> stack =new Stack<>();
        Mytree mytree =new Mytree();
        Mytree.TreeNode root =mytree.creatTree();
        System.out.println(mytree.levelOrder1(root));
//        Mytree.TreeNode nodeE= mytree.find1(root,"E");
//        System.out.println(nodeE.value);
//        System.out.println(mytree.find(root, "F"));
//        System.out.println(mytree.getHeight(root));
//        System.out.println(mytree.getKLevelNodeCount(root, 2));
//        System.out.println(mytree.getLeafNodeCount1(root));
//        System.out.println(mytree.getLeafNodeCount2(root));
//        System.out.println(mytree.size2(root));
//        System.out.println(mytree.size1(root));
//        mytree.preOrder(root);
//        System.out.println();
//        mytree.inOrder(root);
//        System.out.println();
//        mytree.lastOrder(root);
//        List<String> list=mytree.inorderTraversal1(root);
//        System.out.println(list);
    }

}
